Browsing by Subject "Decision theory"
Now showing items 1-20 of 21
-
Article
ABA: Argumentation based agents
(2012)Many works have identified the potential benefits of using argumentation in multiagent settings, as a way to implement the capabilities of agents (eg. decision making, communication, negotiation) when confronted with ...
-
Article
Analysis of neuromuscular disorders using statistical and entropy metrics on surface EMG
(2008)This paper introduces the surface electromyogram (EMG) classification system based on statistical and entropy metrics. The system is intended for diagnostic use and enables classification of examined subject as normal, ...
-
Conference Object
Argumentation Based Decision Making for Autonomous Agents
(2003)This paper presents an argumentation based framework to support the decision making of an agent within a modular architecture for agents. The proposed argumentation framework is dynamic, with arguments and their strength ...
-
Conference Object
Argumentation based modeling of decision aiding for autonomous agents
(2004)Decision Aiding can be abstractly described as the process of assisting a user/client/decision maker by recommending possible courses of his action. This process has to be able to cope with incomplete and/or inconsistent ...
-
Conference Object
A catalog of ∃ℝ-complete decision problems about Nash equilibria in multi-player games
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016)[Schaefer and Štefankovic, Theory of Computing Systems, 2015] provided an explicit formulation of ∃ℝ as the class capturing the complexity of deciding the Existential Theory of the Reals, and established that deciding, ...
-
Article
Centralized Versus Decentralized Optimization of Distributed Stochastic Differential Decision Systems with Different Information Structures-Part I: A General Theory
(2017)Decentralized optimization of distributed stochastic dynamical systems with two or more controls of the decision makers (DMs) has been an active area of research for over half a century. Although, such decentralized ...
-
Article
Complexity of rational and irrational Nash equilibria
(2011)We introduce two new decision problems, denoted as ∃ RATIONAL NASH and ∃ IRRATIONAL NASH, pertinent to the rationality and irrationality, respectively, of Nash equilibria for (finite) strategic games. These problems ask, ...
-
Article
Complexity of rational and irrational nash equilibria
(2014)We introduce two new natural decision problems, denoted as ∃ RATIONAL NASH and ∃ IRRATIONAL NASH, pertinent to the rationality and irrationality, respectively, of Nash equilibria for (finite) strategic games. These problems ...
-
Article
The complexity of synchronous iterative Do-All with crashes
(2004)The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to distributed simulation and multi-agent collaboration. ...
-
Article
Conflicts resolution with the SoDA methodology
(2017)This paper studies the application of argumentation theory and methods from Artificial Intelligence to the problem of conflict resolution. It shows how the decision theories of each of the parties involved in a conflict ...
-
Conference Object
Evaluation of likelihood-ratio and performance bounds for nonlinear decision problems via stochastic PDE
(American Automatic Control Council, 1994)The nonlinear binary decision problem with signal satisfying a diffusion equation observed through noisy measurements is considered. Using the unnormalized conditional density of nonlinear filtering, expressions for ...
-
Article
Extended semantics and optimization algorithms for CP-networks
(2004)Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. Ceteris paribus (CP)-nets were designed to make the process of preference elicitation simpler and more ...
-
Article
Extending argumentation to make good decisions
(2009)Argumentation has been acknowledged as a powerful mechanism for automated decision making. In this context several recent works have studied the problem of accommodating preference information in argumentation. The majority ...
-
Conference Object
A heuristic search algorithm for maneuvering of UAVs across dense thermal areas
(2007)In order to ensure that an aircraft has the potential to meet the assigned performance requirements which are often mission specific, the particular aerodynamic demands involved must be taken into account during the aircraft ...
-
Conference Object
Reliably executing tasks in the presence of untrusted entities
(2006)In this work we consider a distributed system formed by a master processor and a collection of n processors (workers) that can execute tasks
-
Article
Stochastic linear programs with restricted recourse
(1997)Stochastic programs with recourse provide an effective modeling paradigm for sequential decision problems with uncertain or noisy data, when uncertainty can be modeled by a discrete set of scenarios. In two-stage problems ...
-
Article
Stochastic linear programs with restricted recourse
(1997)Stochastic programs with recourse provide an effective modeling paradigm for sequential decision problems with uncertain or noisy data, when uncertainty can be modeled by a discrete set of scenarios. In two-stage problems ...
-
Conference Object
Surface failure detection for an F/A-18 aircraft using neural networks and fuzzy logic
(IEEE, 1994)In this paper we consider the problem of detecting control surface failures of a high performance aircraft. The detection model is developed using a linear, six degree of freedom dynamic model of an F/A-18 aircraft. The ...
-
Conference Object
Two-phase commit optimizations and tradeoffs in the commercial environment
(Publ by IEEE, 1993)An atomic commit protocol can ensure that all participants in a distributed transaction reach consistent states, whether or not system or network failures occur. One widely used protocol is the two-phase commit (2PC) ...
-
Article
Weighted boolean formula games
(2007)We introduce a new class of succinct games, called weighted boolean formula games. Here, each player has a set of boolean formulas he wants to get satisfied. The boolean formulas of all players involve a ground set of ...